Search results for " preference data"
showing 3 items of 3 documents
Projection Clustering Unfolding: A New Algorithm for Clustering Individuals or Items in a Preference Matrix
2020
In the framework of preference rankings, the interest can lie in clustering individuals or items in order to reduce the complexity of the preference space for an easier interpretation of collected data. The last years have seen a remarkable flowering of works about the use of decision tree for clustering preference vectors. As a matter of fact, decision trees are useful and intuitive, but they are very unstable: small perturbations bring big changes. This is the reason why it could be necessary to use more stable procedures in order to clustering ranking data. In this work, a Projection Clustering Unfolding (PCU) algorithm for preference data will be proposed in order to extract useful info…
A Projection Pursuit Algorithm for Preference Data
2018
In the framework of preference rankings, the interest can lie in finding which predictors and which interactions are able to explain the observed preference structures. The last years have seen a remarkable owering of works about the use of decision tree for clustering preference vectors. As a matter of fact, decision trees are useful and intuitive, but they are very unstable: small perturbations bring big changes. This is the reason why it could be necessary to use more stable procedures in order to clustering ranking data. In this work, following the idea of Bolton (2003), a Projection Pursuit (PP) clustering algorithm for preference data will be proposed in order to extract useful inform…
A new position weight correlation coefficient for consensus ranking process without ties
2019
Preference data represent a particular type of ranking data where a group of people gives their preferences over a set of alternatives. The traditional metrics between rankings do not take into account the importance of swapping elements similar among them (element weights) or elements belonging to the top (or to the bottom) of an ordering (position weights). Following the structure of the τx proposed by Emond and Mason and the class of weighted Kemeny–Snell distances, a proper rank correlation coefficient is defined for measuring the correlation among weighted position rankings without ties. The one‐to‐one correspondence between the weighted distance and the rank correlation coefficient ho…